Kinematics of molecular gas in star-forming galaxies with large-scale ionized outflows

We investigate the kinematics of the molecular gas in a sample of seven edge-on (i > 60°) galaxies identified as hosting large-scale outflows of ionized gas, using ALMA CO(1–0) observations at ∼1 kpc resolution. We build on Hogarth et al., where we find that molecular gas is more centrally concentrated in galaxies which host winds than in control objects. We perform full three-dimensional kinematic modelling with multiple combinations of kinematic components, allowing us to infer whether these objects share any similarities in their molecular gas structure. We use modelling to pinpoint the kinematic centre of each galaxy, in order to interpret their minor- and major-axis position velocity diagrams (PVDs). From the PVDs, we find that the bulk of the molecular gas in our galaxies is dynamically cold, tracing the rotation curves predicted by our symmetric, rotation-dominated models, but with minor flux asymmetries. Most notably, we find evidence of radial gas motion in a subset of our objects, which demonstrate a characteristic ‘twisting’ in their minor-axis PVDs generally associated with gas flow along the plane of a galaxy. In our highest S/N object, we include bi-symmetric radial flow in our kinematic model, and find (via the Bayesian Information Criterion) that the presence of radial gas motion is strongly favoured. This may provide one mechanism by which molecular gas and star formation are centrally concentrated, enabling the launch of massive ionized gas winds. However, in the remainder of our sample, we do not observe evidence that gas is being driven radially, once again emphasizing the variety of physical processes that may be powering the outflows in these objects, as originally noted in H21

Design Principles for Sparse Matrix Multiplication on the GPU

We implement two novel algorithms for sparse-matrix dense-matrix multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the popular compressed-sparse-row (CSR) format and thus do not require expensive format conversion. While previous SpMM work concentrates on thread-level parallelism, we additionally focus on latency hiding with instruction-level parallelism and load-balancing. We show, both theoretically and experimentally, that the proposed SpMM is a better fit for the GPU than previous approaches. We identify a key memory access pattern that allows efficient access into both input and output matrices that is crucial to getting excellent performance on SpMM. By combining these two ingredients---(i) merge-based load-balancing and (ii) row-major coalesced memory access---we demonstrate a 4.1x peak speedup and a 31.7% geomean speedup over state-of-the-art SpMM implementations on real-world datasets.Comment: 16 pages, 7 figures, International European Conference on Parallel and Distributed Computing (Euro-Par) 201

Delirium, frailty and mortality: interactions in a prospective study of hospitalized older people

BACKGROUND: It is unknown if the association between delirium and mortality is consistent for individuals across the whole range of health states. A bimodal relationship has been proposed, where delirium is particularly adverse for those with underlying frailty, but may have a smaller effect (perhaps even protective) if it is an early indicator of acute illness in fitter people. We investigated the impact of delirium on mortality in a cohort simultaneously evaluated for frailty. METHODS: We undertook an exploratory analysis of a cohort of consecutive acute medical admissions aged ≥70. Delirium on admission was ascertained by psychiatrists. A Frailty Index (FI) was derived according to a standard approach. Deaths were notified from linked national mortality statistics. Cox regression was used to estimate associations between delirium, frailty and their interactions on mortality. RESULTS: The sample consisted of 710 individuals. Both delirium and frailty were independently associated with increased mortality rates (delirium: HR 2.4, 95%CI 1.8–3.3, p<0.01; frailty (per SD): HR 3.5, 95%CI 1.2–9.9, p=0.02). Estimating the effect of delirium in tertiles of FI, mortality was greatest in the lowest tertile: tertile 1 HR 3.4 (95%CI 2.1–5.6); tertile 2 HR 2.7 (95%CI 1.5–4.6); tertile 3 HR 1.9 (95% CI 1.2–3.0). CONCLUSION: While delirium and frailty contribute to mortality, the overall impact of delirium on admission appears to be greater at lower levels of frailty. In contrast to the hypothesis that there is a bimodal distribution for mortality, delirium appears to be particularly adverse when precipitated in fitter individuals

Constrained Min-Cut replication for K-Way hypergraph partitioning

Cataloged from PDF version of article.Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning are proposed for various problems arising in information retrieval and database systems. We consider the possibility of using vertex replication to improve the quality of hypergraph partitioning. In this study, we focus on the constrained min-cut replication (CMCR) problem, where we are initially given a maximum replication capacity and a K-way hypergraph partition with an initial imbalance ratio. The objective in the CMCR problem is finding the optimal vertex replication sets for each part of the given partition such that the initial cut size of the partition is minimized, where the initial imbalance is either preserved or reduced under the given replication capacity constraint. In this study, we present a complexity analysis of the CMCR problem and propose a model based on a unique blend of coarsening and integer linear programming (ILP) schemes. This coarsening algorithm is derived from a novel utilization of the Dulmage-Mendelsohn decomposition. Experiments show that the ILP formulation coupled with the Dulmage-Mendelsohn decomposition-based coarsening provides high quality results in practical execution times for reducing the cut size of a given K-way hypergraph partition. © 2014 INFORMS

Monoclonal antibodies in neuro-oncology: Getting past the blood-brain barrier

Monoclonal antibodies (mAbs) are used with increasing success against many tumors, but for brain tumors the blood-brain barrier (BBB) is a special concern. The BBB prevents antibody entry to the normal brain; however, its role in brain tumor therapy is more complex. The BBB is closest to normal at micro-tumor sites; its properties and importance change as the tumor grows. In this review, evolving insight into the role of the BBB is balanced against other factors that affect efficacy or interpretation when mAbs are used against brain tumor targets. As specific examples, glioblastoma multiforme (GBM), primary central nervous system lymphoma (PCNSL) and blood-borne metastases from breast cancer are discussed in the context of treatment, respectively, with the mAbs bevacizumab, rituximab and trastuzumab, each of which is already widely used against tumors outside the brain. It is suggested that success against brain tumors will require getting past the BBB in two senses: physically, to better attack brain tumor targets, and conceptually, to give equal attention to problems that are shared with other tumor sites

Perfectly matched layers in transmission lines

The field distribution at the ports of the transmission line structure is computed by applying Maxwell's equations to the structure and solving an eigenvalue problem. The high dimensional sparse system matrix is complex in the presence of losses and Perfectly Matched Layer. A method is presented which preserves sparseness and delivers only the small number of interesting modes out with the smallest attenuation. The modes are found solving a sequence of eigenvalue problems of modified matrices with the aid of the invert mode of the Arnoldi iteration using shifts. A new strategy is described which allows the application of the method, first developed for microwave structures, to optoelectronic devices

Propagation of an Earth-directed coronal mass ejection in three dimensions

Solar coronal mass ejections (CMEs) are the most significant drivers of adverse space weather at Earth, but the physics governing their propagation through the heliosphere is not well understood. While stereoscopic imaging of CMEs with the Solar Terrestrial Relations Observatory (STEREO) has provided some insight into their three-dimensional (3D) propagation, the mechanisms governing their evolution remain unclear due to difficulties in reconstructing their true 3D structure. Here we use a new elliptical tie-pointing technique to reconstruct a full CME front in 3D, enabling us to quantify its deflected trajectory from high latitudes along the ecliptic, and measure its increasing angular width and propagation from 2-46 solar radii (approximately 0.2 AU). Beyond 7 solar radii, we show that its motion is determined by an aerodynamic drag in the solar wind and, using our reconstruction as input for a 3D magnetohydrodynamic simulation, we determine an accurate arrival time at the Lagrangian L1 point near Earth.Comment: 5 figures, 2 supplementary movie

Efficient load balancing techniques for graph traversal applications on GPUs

Efficiently implementing a load balancing technique in graph traversal applications for GPUs is a critical task. It is a key feature of GPU applications as it can sensibly impact on the overall application performance. Different strategies have been proposed to deal with such an issue. Nevertheless, the efficiency of each of them strongly depends on the graph characteristics and no one is the best solution for any graph. This paper presents three different balancing techniques and how they have been implemented to fully exploit the GPU architecture. It also proposes a set of support strategies that can be modularly applied to the main balancing techniques to better address the graph characteristics. The paper presents an analysis and a comparison of the three techniques and support strategies with the best solutions at the state of the art over a large dataset of representative graphs. The analysis allows statically identifying, given graph characteristics and for each of the proposed techniques, the best combination of supports, and that such a solution is more efficient than the techniques at the state of the art

Matched sizes of activating and inhibitory receptor/ligand pairs are required for optimal signal integration by human Natural Killer cells

It has been suggested that receptor-ligand complexes segregate or co-localise within immune synapses according to their size, and this is important for receptor signaling. Here, we set out to test the importance of receptor-ligand complex dimensions for immune surveillance of target cells by human Natural Killer (NK) cells. NK cell activation is regulated by integrating signals from activating receptors, such as NKG2D, and inhibitory receptors, such as KIR2DL1. Elongating the NKG2D ligand MICA reduced its ability to trigger NK cell activation. Conversely, elongation of KIR2DL1 ligand HLA-C reduced its ability to inhibit NK cells. Whereas normal-sized HLA-C was most effective at inhibiting activation by normal-length MICA, only elongated HLA-C could inhibit activation by elongated MICA. Moreover, HLA-C and MICA that were matched in size co-localised, whereas HLA-C and MICA that were different in size were segregated. These results demonstrate that receptor-ligand dimensions are important in NK cell recognition, and suggest that optimal integration of activating and inhibitory receptor signals requires the receptor-ligand complexes to have similar dimensions

A Sparse Stress Model

Force-directed layout methods constitute the most common approach to draw general graphs. Among them, stress minimization produces layouts of comparatively high quality but also imposes comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016